The spread of Kn

On the Defining Number of (2n - 2)-Vertex Colorings of Kn x Kn

The linear 3-arboricity of Kn, n and Kn

A linear k-forest is a forest whose components are paths of length at most k. The linear k-arboricity of a graph G, denoted by lak(G), is the least number of linear k-forests needed to decompose G. In this paper, we completely determine lak(G) when G is a balanced complete bipartite graph Kn,n or a complete graph Kn, and k = 3. © 2007 Elsevier B.V. All rights reserved.

Diameter of the Kn odel

Diameter of the 2 k-node Knn odel graph is d(k + 2)=2e:

Production of the pentaquark exotic baryon Ξ 5 in KN scattering : KN → K Ξ 5 and KN → K ∗ Ξ 5

Abstract We investigate the production of the newly found pentaquark exotic baryon Ξ5 in the KN → KΞ5 and KN → KΞ5 reactions at the tree level. We consider the both positiveand negativeparities of the Ξ5. The reactions are dominated by the sand u-channel processes, and it is observed that the resulting cross sections are very much dependent on the parity of Ξ5 and on the type of form factor. We...

Bishellable drawings of Kn

The Harary-Hill conjecture, still open after more than 50 years, asserts that the crossing number of the complete graph Kn is H(n) = 1 4 ⌊ n 2 ⌋⌊ n− 1 2 ⌋⌊ n− 2 2 ⌋⌊ n− 3 2 ⌋ . Ábrego et al. [3] introduced the notion of shellability of a drawing D of Kn. They proved that if D is s-shellable for some s ≥ b 2 c, then D has at least H(n) crossings. This is the first combinatorial condition on a dr...